Efficient Rough Set Theory Merging
نویسنده
چکیده
Theory exploration is a term describing the development of a formal (i.e. with the help of an automated proof-assistant) approach to selected topic, usually within mathematics or computer science. This activity however usually doesn’t reflect the view of science considered as a whole, not as separated islands of knowledge. Merging theories essentially has its primary aim of bridging these gaps between specific disciplines. As we provided formal apparatus for basic notions within rough set theory (as e.g. approximation operators and membership functions), we try to reuse the knowledge which is already contained in available repositories of computer-checked mathematical knowledge, or which can be obtained in a relatively easy way. We can point out at least three topics here: topological aspects of rough sets – as approximation operators have properties of the topological interior and closure; lattice-theoretic approach giving the algebraic viewpoint (e.g. Stone algebras); possible connections with formal concept analysis. In such a way we can give the formal characterization of rough sets in terms of topologies or orders. Although fully formal, still the approach can be revised to keep the uniformity all the time.
منابع مشابه
Reduction of DEA-Performance Factors Using Rough Set Theory: An Application of Companies in the Iranian Stock Exchange
he financial management field has witnessed significant developments in recent years to help decision makers, managers and investors, to made optimal decisions. In this regard, the institutions investment strategies and their evaluation methods continuously change with the rapid transfer of information and access to the fi- nancial data. When information is available ...
متن کاملT-Rough Sets Based on the Lattices
The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...
متن کاملTopological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملارائه روشی ترکیبی برای افزایش دقت پیشبینی در کاهش داده با استفاده از مدل مجموعه راف و هوش تجمعی
Designing a system with an emphasis on minimal human intervention helps users to explore information quickly. Adverting to methods of analyzing large data is compulsory as well. Hence, utilizing power of the data mining process to identify patterns and models become more essential from aspect of relationship between the various elements in the database and discover hidden knowledge. Therefore, ...
متن کاملApplication of Rough Set Theory in Data Mining for Decision Support Systems (DSSs)
Decision support systems (DSSs) are prevalent information systems for decision making in many competitive business environments. In a DSS, decision making process is intimately related to some factors which determine the quality of information systems and their related products. Traditional approaches to data analysis usually cannot be implemented in sophisticated Companies, where managers ne...
متن کامل